A weighted pointwise ergodic theorem

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Pointwise Ergodic Theorem for Imprecise Markov Chains

We prove a game-theoretic version of the strong law of large numbers for submartingale differences, and use this to derive a pointwise ergodic theorem for discrete-time Markov chains with finite state sets, when the transition probabilities are imprecise, in the sense that they are only known to belong to some convex closed set of probability measures.

متن کامل

Pointwise Dimension and Ergodic Decompositions

We study the Hausdorff dimension and the pointwise dimension of measures that are not necessarily ergodic. In particular, for conformal expanding maps and hyperbolic diffeomorphisms on surfaces we establish explicit formulas for the pointwise dimension of an arbitrary invariant measure in terms of the local entropy and of the Lyapunov exponents. These formulas are obtained with a direct approac...

متن کامل

A Marginal Ergodic Theorem

Michael Lavine Duke University, Durham, NC, USA. Summary. In recent years there have been several papers giving examples of Markov Chain Monte Carlo (MCMC) algorithms whose invariant measures are improper (have infinite mass) and which therefore are not positive recurrent, yet which have subchains from which valid inference can be derived. These are nonergodic (not having a limiting distributio...

متن کامل

Pointwise Convergence of Some Multiple Ergodic Averages

We show that for every ergodic system (X, μ,T1, . . . ,Td) with commuting transformations, the average 1 Nd+1 ∑ 0≤n1,...,nd≤N−1 ∑ 0≤n≤N−1 f1(T n 1 d ∏ j=1 T n j j x) f2(T n 2 d ∏ j=1 T n j j x) · · · fd(T n d d ∏ j=1 T n j j x). converges for μ-a.e. x ∈ X as N → ∞. If X is distal, we prove that the average 1 N N ∑ i=0 f1(T n 1 x) f2(T n 2 x) · · · fd(T n d x) converges for μ-a.e. x ∈ X as N → ∞...

متن کامل

Kingman's Subadditive Ergodic Theorem Kingman's Subadditive Ergodic Theorem

A simple proof of Kingman’s subadditive ergodic theorem is developed from a point of view which is conceptually algorithmic and which does not rely on either a maximal inequality or a combinatorial Riesz lemma.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annales de l'Institut Henri Poincare (B) Probability and Statistics

سال: 1998

ISSN: 0246-0203

DOI: 10.1016/s0246-0203(98)80021-6